An Algorithm for Dualization in Products of Lattices and Its Applications
نویسنده
چکیده
Let L = L1 × · · · × Ln be the product of n lattices, each of which has a bounded width. Given a subset A ⊆ L, we show that the problem of extending a given partial list of maximal independent elements of A in L can be solved in quasi-polynomial time. This result implies, in particular, that the problem of generating all minimal infrequent elements for a database with semi-lattice attributes, and the problem of generating all maximal boxes that contain at most a specified number of points from a given n-dimensional point set, can both be solved in incremental quasi-polynomial time.
منابع مشابه
Dualization on Partially Ordered Sets: Preliminary Results
The dualization problem on arbitrary posets is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The objective of this paper is to study reductions of the dualization problem on arbitrary posets to the dualization problem on boolean lattices, for which output quasi-polynomial time algorithms exist. We introduce convex embedding and poset refle...
متن کاملAn Algorithm for Dualization in Products of Lattices
Let L = L1 × · · · × Ln be the product of n lattices, each of which has a bounded width. Given a subset A ⊆ L, we show that the problem of extending a given partial list of maximal independent elements of A in L can be solved in quasi-polynomial time.
متن کاملExtended dualization: Application to maximal pattern mining
The dualization in arbitrary posets is a well-studied problem in combinatorial enumeration and is a crucial step in many applications in logics, databases, artificial intelligence and pattern mining. The objective of this paper is to study reductions of the dualization problem on arbitrary posets to the dualization problem on boolean lattices, for which output quasi-polynomial time algorithms e...
متن کاملDualization in lattices given by ordered sets of irreducibles
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and join irreducibles (i.e., as a concept lattice of a formal context). We show that in this case dualization is equivalent to the enumeration of so-called mini...
متن کاملRobust Wagner–Whitin algorithm with uncertain costs
In real-world applications, costs for products are not deterministic: neither static nor dynamic. They actually tend to be non-stationary and cross-correlated. To overcome this drawback, there have been some efforts by researchers to extend the Wagner–Whitin algorithm to consider stochastic costs. However, they assume that the information of probability density function of random costs exists. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002